Random Euclidean matching problems in one dimension
نویسندگان
چکیده
منابع مشابه
One-loop diagrams in the Random Euclidean Matching Problem
The matching problem is a notorious combinatorial optimization problem that has attracted for many years the attention of the statistical physics community. Here we analyze the Euclidean version of the problem, i.e., the optimal matching problem between points randomly distributed on a d-dimensional Euclidean space, where the cost to minimize depends on the points' pairwise distances. Using May...
متن کاملOn a Class of Diffeomorphic Matching Problems in One Dimension
We study a class of functional which can be used for matching objects which can be represented as mappings from a fixed interval, I, to some “feature space.” This class of functionals corresponds to “elastic matching” in which a symmetry condition and a “focus invariance” are imposed. We provide sufficient conditions under which an optimal matching can be found between two such mappings, the op...
متن کاملOn Euclidean random matrices in high dimension
In this note, we study the n×n random Euclidean matrix whose entry (i, j) is equal to f(‖Xi−Xj‖) for some function f and the Xi’s are i.i.d. isotropic vectors inR. In the regime where n and p both grow to infinity and are proportional, we give some sufficient conditions for the empirical distribution of the eigenvalues to converge weakly. We illustrate our result on log-concave random vectors.
متن کاملAbsorption Problems for Quantum Random Walks in One Dimension
This paper treats absorption problems for the one-dimensional quantum random walk determined by a 2× 2 unitary matrix U on a state space {0, 1, . . . ,N} where N is finite or infinite by using a new path integral approach based on an orthonormal basis P,Q,R and S of the vector space of complex 2× 2 matrices. Our method studied here is a natural extension of the approach in the classical random ...
متن کاملDiffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties which should be satisfied by the optimal matching. A new, exact, dynamic programming algorithm is then designed for the minimization. We conclude with experimental results on shape comparison.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2017
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.96.042102